Dynamic Bid Prices in Revenue Management
نویسنده
چکیده
We formally derive the standard deterministic linear program (LP) for bid-price control by making an affine functional approximation to the optimal dynamic programming value function. This affine functional approximation gives rise to a new LP that yields tighter bounds than the standard LP. Whereas the standard LP computes static bid prices, our LP computes a time trajectory of bid prices. We show that there exist dynamic bid prices, optimal for the LP, that are individually monotone with respect to time. We provide a column generation procedure for solving the LP within a desired optimality tolerance, and present numerical results on computational and economic performance.
منابع مشابه
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend on how much time is left until departure. We show that our method provides an upper bound on the optimal total expected revenue and this upper bound is tighter than the one provided by the widely known deterministic lin...
متن کاملAn Analysis of Bid-Price Controls for Network Revenue Management
Bid-prices are becoming an increasingly popular method for controlling the sale of inventory in revenue management applications. In this form of control, threshold—or ‘‘bid’’—prices are set for the resources or units of inventory (seats on flight legs, hotel rooms on specific dates, etc.) and a product (a seat in a fare class on an itinerary or room for a sequence of dates) is sold only if the ...
متن کاملImproved bid prices for choice-based network revenue management
In many implemented network revenue management systems, a bid price control is being used. In this form of control bid, prices are attached to resources, and a product is offered if the revenue derived from it exceeds the sum of the bid prices of its consumed resources. This approach is appealing because once bid prices have been determined, it is fairly simple to derive the products that shoul...
متن کاملUsing Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the temporal dynamics of the arrivals of the itinerary requests and generates bid prices that depend on the remaining leg capacities. Our method is based on relaxing certain constraints that link the decisions for different flight legs by associati...
متن کاملTime-Dependent Bid Prices for Multi-Period Network Revenue Management Problems
In this paper, we propose new mathematical programming approaches for computing time-dependent bid prices in network revenue management problems. In contrast with previous models, ours can accommodate more than one customer request between two successive bid price updates, as frequently occurs in practice. As a first approach, we introduce a simplified version of our time-dependent bid price mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 55 شماره
صفحات -
تاریخ انتشار 2007